On Torus Topologies with Random Extra Links
نویسنده
چکیده
In this paper we study networks based on torus topologies enhanced with additional, arbitrary assigned links. We develop a method for analyzing the expected number of hops which can be applied to any torus topol-ogy with randomly assigned extra links when the simplest greedy routing is used. Using this method, we study the following topologies with extra links: one-dimensional unidirectional and bidirectional torus (i.e., ring), and two-dimensional bidirectional and unidirec-tional torus (e.g., Bidirectional Manhattan Network and Manhattan Street Network). We also show how these results can be extended to some non-torus topolo-gies with extra links, such as the bus and the two-dimensional grid. From our analysis we nd that the expected number of hops in a D-dimensional N-node torus with extra links grows as O(D+1 p N) and that it can be reduced to O(2D p N) with the orthogonal assignment of extra links.
منابع مشابه
A New Cross-By-Pass-Torus Architecture Based on CBP-Mesh and Torus Interconnection for On-Chip Communication
A Mesh topology is one of the most promising architecture due to its regular and simple structure for on-chip communication. Performance of mesh topology degraded greatly by increasing the network size due to small bisection width and large network diameter. In order to overcome this limitation, many researchers presented modified Mesh design by adding some extra links to improve its performanc...
متن کاملTask mapping in rectangular twisted tori
Twisted torus topologies have been proposed as an alternative to toroidal rectangular networks, improving distance parameters and providing network symmetry. However, twisting is apparently less amenable to task mapping algorithms of real life applications. In this paper we make an analytical study of different mapping and concentration techniques on 2D twisted tori that try to compensate for t...
متن کاملThe Multidimensional Torus : Analysis of Average HopDistance and Application as
Distance and Application as a Multihop Lightwave Network1 Dhritiman Banerjee, Biswanath Mukherjee and S. Ramamurthy Division of Computer Science, University of California, Davis, CA 95616 E-mail: [email protected], [email protected], [email protected] ABSTRACT The torus network, whose two-dimensional version is often referred to as the Manhattan Street Network (MSN), has received ...
متن کاملDistributed Fault-Tolerant Embedding of Several Topologies in Hypercubes
Embedding is of great importance in the applications of parallel computing. Every parallel application has its intrinsic communication pattern. The communication pattern graph is mapped onto the topology of multiprocessor structures so that the corresponding application can be executed. To increase the reliability of parallel applications, fault-tolerant embedding is necessary. In this paper, w...
متن کاملSearching for a black hole in interconnected networks using mobile agents and tokens
We study the impact of topological structure on the complexity of the Black hole search (Bhs) problem using mobile agents that communicate via tokens. First, we show that the token model can support the same cost as in the whiteboard model, despite the fact that communication between mobile agents is considerably more restricted (and complex) in a token model than in a whiteboard one. More prec...
متن کامل